11![Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt, Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,](https://www.pdfsearch.io/img/e5f903527d60e1d0dda3eaa74301856c.jpg) | Add to Reading ListSource URL: www.dr-dau.netLanguage: English - Date: 2007-08-09 21:04:38
|
---|
12![Distributed Community Detection on Edge-labeled Graphs using Spark San-Chuan Hung Miguel Araujo Distributed Community Detection on Edge-labeled Graphs using Spark San-Chuan Hung Miguel Araujo](https://www.pdfsearch.io/img/9b377039962798c3fb164a7700560689.jpg) | Add to Reading ListSource URL: www.mlgworkshop.orgLanguage: English - Date: 2016-08-14 01:22:56
|
---|
13![Advances in Cognitive SystemsSubmitted; publishedExploiting Graph Structure to Abstract & Compress Relational Data Advances in Cognitive SystemsSubmitted; publishedExploiting Graph Structure to Abstract & Compress Relational Data](https://www.pdfsearch.io/img/83c35cecaa13c238dc1fc5c277f04267.jpg) | Add to Reading ListSource URL: www.cogsys.orgLanguage: English - Date: 2016-06-16 21:32:57
|
---|
14![Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na](https://www.pdfsearch.io/img/74a3e7ab8b2ea105bdd42855c7abe74f.jpg) | Add to Reading ListSource URL: pagesperso.lina.univ-nantes.frLanguage: English - Date: 2012-04-20 08:45:09
|
---|
15![Nested Concept Graphs with Cuts: Mathematical Foundations Frithjof Dau, Joachim Hereth Correia Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt, {dau,hereth}@mathematik.t Nested Concept Graphs with Cuts: Mathematical Foundations Frithjof Dau, Joachim Hereth Correia Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt, {dau,hereth}@mathematik.t](https://www.pdfsearch.io/img/a7db167a4f71fa143fee0faa36c1ac83.jpg) | Add to Reading ListSource URL: www.dr-dau.netLanguage: English - Date: 2007-08-09 21:04:38
|
---|
16![VERTEX PERFECT GRAPHS By Riley Littlefield A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF VERTEX PERFECT GRAPHS By Riley Littlefield A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF](https://www.pdfsearch.io/img/b1342bff6da304cfc63c07c4409c88dc.jpg) | Add to Reading ListSource URL: www2.stetson.eduLanguage: English - Date: 2015-04-24 19:11:58
|
---|
17![An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de](https://www.pdfsearch.io/img/f2c863270aea4ed15e420a3d3411d201.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2008-11-30 14:19:38
|
---|
18![Rectangular Decomposition of Binary Images Tom´ aˇs Suk, Cyril H¨oschl IV, and Jan Flusser Institute of Information Theory and Automation of the ASCR, Pod vod´ arenskou vˇeˇz´ı 4, Praha 8, Czech Republic Rectangular Decomposition of Binary Images Tom´ aˇs Suk, Cyril H¨oschl IV, and Jan Flusser Institute of Information Theory and Automation of the ASCR, Pod vod´ arenskou vˇeˇz´ı 4, Praha 8, Czech Republic](https://www.pdfsearch.io/img/d8d661d8a495b2377d07798fae6b6c8f.jpg) | Add to Reading ListSource URL: library.utia.cas.czLanguage: English - Date: 2012-08-15 08:16:50
|
---|
19![New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ § New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §](https://www.pdfsearch.io/img/d680391bdc7f97710a1dd36f08b8bf8f.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2016-05-11 15:56:58
|
---|
20![PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic](https://www.pdfsearch.io/img/25249ebc7b6fa1095b01aecd2fa73b4e.jpg) | Add to Reading ListSource URL: www.cs.mun.caLanguage: English - Date: 2015-03-23 10:06:06
|
---|